Path Integral Optimization as Circuit Complexity
نویسندگان
چکیده
منابع مشابه
Estimating Shortest Circuit Path Length Complexity
When binary decision diagrams are formed from uniformly distributed Monte Carlo data for a large number of variables, the complexity of the decision diagrams exhibits a predictable relationship to the number of variables and minterms. In the present work, a neural network model has been used to analyze the pattern of shortest path length for larger number of Monte Carlo data points. The neural ...
متن کاملWire length as a circuit complexity measure
We introduce wire length as a salient complexity measure for analyzing the circuit complexity of sensory processing in biological neural systems. This new complexity measure is applied in this paper to two basic computational problems that arise in translationand scale-invariant pattern recognition, and hence appear to be useful as benchmark problems for sensory processing. We present new circu...
متن کاملGlobal Optimization: Quantum Thermal Annealing with Path Integral Monte Carlo
We investigate a new method (QTA-PIMC) for global optimization on complex potential energy surfaces which combines the path integral Monte Carlo method with quantum and thermal annealing. This method is applied to the BLN protein model (Honeycutt, J. D.; Thirumalai, D. Biopolymers 1992, 32, 695). We show that this new approach outperforms simulated (thermal) annealing (SA) and that in fact SA i...
متن کاملA Design Path for Optimization-based Analog Circuit Design
In this paper we propose a design path for optimization-based device sizing of analog circuits. The design path offers an efficient and reliable way to implement high-performance analog integrated circuits without the explicit knowledge of an experienced designer. A key feature is that the partial cost functions are generated directly from the circuit topology. To demonstrate the functionality ...
متن کاملCircuit Complexity
Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2019
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.123.011601